Analysis of Lower Bounds for the Multislope Ski-Rental Problem
نویسندگان
چکیده
The multislope ski-rental problem is an extension of the classical ski-rental problem, where the player has several options of paying both of a per-time fee and an initial fee, in addition to pure renting and buying options. Damaschke gave a lower bound of 3.62 on the competitive ratio for the case where arbitrary number of options can be offered. In this paper we propose a scheme that for the number of options given as an input, provides a lower bound on the competitive ratio, by extending the method of Damaschke. This is the first to establish a lower bound for each of the 5-or-more-option cases, for example, a lower bound of 2.95 for the 5-option case, 3.08 for the 6-option case, and 3.18 for the 7-option case. Moreover, it turns out that our lower bounds for the 3and 4-option cases respectively coincide with the known upper bounds. We therefore conjecture that our scheme in general derives a matching lower and upper bound.
منابع مشابه
On the Best Possible Competitive Ratio for Multislope Ski Rental
The multislope ski-rental problem [LPSR08a] is an extension of the classical ski-rental problem [KMRS88], where the player has several lease options in addition to the pure rent and buy options. In this problem an instance, which is the setting of the options, significantly affects the player’s performance. There is an algorithm that for a given instance, computes the best possible strategy [AI...
متن کاملRent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental
In the Multislope Ski Rental problem, the user needs a certain resource for some unknown period of time. To use the resource, the user must subscribe to one of several options, each of which consists of a one-time setup cost (“buying price”), and cost proportional to the duration of the usage (“rental rate”). The larger the price, the smaller the rent. The actual usage time is determined by an ...
متن کاملThe Semi-stochastic Ski-rental Problem
In this paper, we introduce the semi-stochastic model for dealing with input uncertainty in optimization problems. This model is a hybrid between the overly pessimistic online model and the highly optimistic stochastic (or Bayesian) model. In this model, the algorithm can obtain only limited stochastic information about the future (i.e. about the input distribution)—as the amount of stochastic ...
متن کاملSki rental with two general options
We define and solve a simple extension of the ski-rental problem [4]. In the classical version, the algorithm needs to decide when to switch from renting to buying. In our version, no pure buy option is available: even after switching to the buy option, the algorithm needs to pay some reduced rent. We present an online algorithm for this problem with a matching lower bound.
متن کاملCompetitive Analysis
The ski rental problem arises from the following scenario. You want to start skiing, but you don’t own any skis. On each day you go skiing, you can either choose to rent skis for cost 1, or you can buy skis for cost s. Since you don’t know when you might get sick of skiing, (or when you might break your leg and be unable to ski again), the number of days d that you will end up skiing is unknown...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 97-A شماره
صفحات -
تاریخ انتشار 2014